A Note on Congruences of Infinite Bounded Involution Lattices

نویسندگان

چکیده

We prove that an infinite (bounded) involution lattice and even pseudo-Kleene algebra can have any number of congruences between 2 its elements or equalling subsets, regardless whether it has as many ideals subsets. Furthermore, when they at most elements, these lattices algebras be chosen such all their preserve involutions, so reducts. Under the Generalized Continuum Hypothesis, this means ideals. Consequently, same holds for antiortholattices, a class paraorthomodular Brouwer-Zadeh lattices. Regarding shapes congruence lattice{ ordered in question, turns out that, long is not strictly larger than isomorphic to nonsingleton well-ordered set with largest element those cardinalities, provided join-irreducible case bounded lattice-ordered and, antiortholattices least 3 distinct predecessor join{irreducible, well; course, various constructions applied obtain different structures without changing cardinalities question. point sufficient conditions analogous results hold arbitrary variety.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on bounded automorphisms of infinite graphs

Let X be a connected locally finite graph with vertex-transitive automorphism group. If X has polynomial growth then the set of all bounded automorphisms of finite order is a locally finite, periodic normal subgroup of AUT(X) and the action of AUT(X) on V(X) is imprimitive if X is not finite. If X has infinitely many ends, the group of bounded automorphisms itself is locally finite and periodic.

متن کامل

Commutative integral bounded residuated lattices with an added involution

By a symmetric residuated lattice we understand an algebra A = (A,∨,∧, ∗,→,∼, 1, 0) such that (A,∨,∧, ∗,→, 1, 0) is a commutative integral bounded residuated lattice and the equations ∼∼ x = x and ∼ (x ∨ y) =∼ x∧ ∼ y are satisfied. The aim of the paper is to investigate properties of the unary operation ε defined by the prescription εx :=∼ x → 0. We give necessary and sufficient conditions for ...

متن کامل

A note on computing involution centralizers

For a black box group G and t an involution of G we describe a computational procedure which produces elements of CG(t) by making use of the local fusion graph F(G, X), where X is the G-conjugacy class of t.

متن کامل

A note on ordinal sums of t-norms on bounded lattices

Ordinal sums of t-norms on bounded lattices are discussed. It is shown that this construction leads always to a t-norm in the case of horizontal sums of chains. Moreover, we obtain a t-norm also if the underlying lattice is an ordinal sum (in the sense of Birkhoff) of the carriers of the summands.

متن کامل

Notes on Planar Semimodular Lattices. Ii. Congruences

We show that in a finite semimodular lattice, the ordering of joinirreducible congruences is done in a special type of sublattice, we call a tight S7.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Annals of Computer Science

سال: 2021

ISSN: ['1843-8121', '2248-2695']

DOI: https://doi.org/10.7561/sacs.2021.1.51